Optimal pebbling in products of graphs
نویسندگان
چکیده
We prove a generalization of Graham’s Conjecture for optimal pebbling with arbitrary sets of target distributions. We provide bounds on optimal pebbling numbers of products of complete graphs and explicitly find optimal t-pebbling numbers for specific such products. We obtain bounds on optimal pebbling numbers of powers of the cycle C5. Finally, we present explicit distributions which provide asymptotic bounds on optimal pebbling numbers of hypercubes.
منابع مشابه
Critical Pebbling Numbers of Graphs
We define three new pebbling parameters of a connected graph G, the r-, g-, and ucritical pebbling numbers. Together with the pebbling number, the optimal pebbling number, the number of vertices n and the diameter d of the graph, this yields 7 graph parameters. We determine the relationships between these parameters. We investigate properties of the r-critical pebbling number, and distinguish b...
متن کاملt-Pebbling and Extensions
We give upper bounds on t-pebbling numbers of graphs of small diameter and investigate the relationships between these results and those relating to fractional pebbling. Furthermore, we present a connection between optimal pebbling and linear optimization and utilize this relationship in analyzing various graphs. We introduce the optimal fractional pebbling number of a graph and provide a combi...
متن کاملPebbling in Split Graphs
Finding the pebbling number of a graph is harder than NP-complete (Π 2 complete, to be precise). However, for many families of graphs there are formulas or polynomial algorithms for computing pebbling numbers; for example, complete graphs, products of paths (including cubes), trees, cycles, diameter two graphs, and more. Moreover, graphs having minimum pebbling number are called Class 0, and ma...
متن کاملCover Pebbling Cycles and Certain Graph Products
A pebbling step on a graph consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. A graph is said to be cover pebbled if every vertex has a pebble on it after a series of pebbling steps. The cover pebbling number of a graph is the minimum number of pebbles such that the graph can be cover pebbled, no matter how the pebbles are initially placed on the vert...
متن کاملGraph pegging numbers
In graph pegging, we view each vertex of a graph as a hole into which a peg can be placed, with checker-like “pegging moves” allowed. Motivated by well-studied questions in graph pebbling, we introduce two pegging quantities. The pegging number (respectively, the optimal pegging number) of a graph is the minimum number of pegs such that for every (respectively, some) distribution of that many p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 50 شماره
صفحات -
تاریخ انتشار 2011